数据库系统安全模型的设计

本文首先分析了有关数据库安全所需要解决的几个问题,并基于 discretion 和mandatory 存取策略,以及完整性和数据库加密策略,提出了一个较完整的数据库系统的安全模型。     

瞄准具多因素误差分析模型

本文利用坐标轴旋转公式建立了瞄准具多因素误差分析模型。为机械式、半独立式瞄准具的不解体检测提供了理论基础.     

一种顺序PROLOG机系统结构的研究

文中概述顺序执行PROLOG程序的计算机的一种系统结构的研究和实现情况,主要包括一个扩充的顺序PROLOG的抽象执行模型、机器指令系统、编译型PROLOG数据库的研究与实现算法、实验系统YH-SIM-ES的设计与实现、以及一种支持快速回顾的PROLOG机硬件组织的研究。     

空战模型研究

本文论述了空战一般作战模式厦空战构模特点,并具体构造了一个集团军作战规模的训练用空战模型。利用该模型对不同空战编队的作战效果进行了计算,其结果可用干战术分析。     

索赔离散到达的风险模型

讨论了索赔到达时间和索赔额均服从几何分布的风险模型 ,利用逐段决定马尔可夫骨架过程的广义生成算子去构造有关盈余过程的鞅 ,精确求解了模型的破产概率     

解决大功率柴油机曲轴箱通气装置漏油的途径

介绍了采用气体循环解决某型坦克发动机通气装置漏油问题的方法,通过建立进气系统模型、缸内过程模型、排气系统模型、气体循环系统模型,为进行精确的计算奠定了基础,同时也为硬件设计提供了方案.     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

An integer programming model for the weekly tour scheduling problem

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001.     

一种性能驱动的时序规划方法

在超级计算机体系结构设计阶段 ,有必要进行时序规划 ,以尽早判断设计方案和性能指标的物理可实现性。提出一种性能驱动的时序规划方法 ,采用适于组件性能描述的时序性能模型 ,并按照线网权重分配路径延时余量 ,算法具有效率高、延时分配合理的优点     

密集回波环境下的一种交互式多模型算法

利用神经网络算法对基于机动目标“当前”统计模型的均值和方差自适应滤波算法进行修改 ,提高该算法的性能 ;然后与匀速模型交互作用 ,利用概率数据关联处理密集回波环境下机动目标的跟踪问题 ,这样既保持了对强机动目标的跟踪性能 ,同时又提高了对弱机动目标的跟踪精度。仿真结果证明该算法确为一种非常有效的方法